A Fast Method to Estimate Partial Weights Enumerators by Hash Techniques and Automorphism Group
نویسندگان
چکیده
منابع مشابه
A Fast Method to Estimate Partial Weights Enumerators by Hash Techniques and Automorphism Group
BCH codes have high error correcting capability which allows classing them as good cyclic error correcting codes. This important characteristic is very useful in communication and data storage systems. Actually after almost 60 years passed from their discovery, their weights enumerators and therefore their analytical performances are known only for the lengths less than or equal to 127 and only...
متن کاملNovel Techniques for Automorphism Group Computation
Graph automorphism (GA) is a classical problem, in which the objective is to compute the automorphism group of an input graph. In this work we propose four novel techniques to speed up algorithms that solve the GA problem by exploring a search tree. They increase the performance of the algorithm by allowing to reduce the depth of the search tree, and by effectively pruning it. We formally prove...
متن کاملA Fast Method to Estimate Body Capacitance to Ground
This paper describes a method to estimate the capacitance between the human body and earth ground that is based on an impedance analyzer intended to measure ungrounded impedances. The method does not need any external components other than two common resistors, works in the 10 kHz to 1 MHz frequency range, and can be applied to other grounded impedances.
متن کاملa comparative study of language learning strategies employmed by bilinguals and monolinguals with reference to attitudes and motivation
هدف از این تحقیق بررسی برخی عوامل ادراکی واحساسی یعنی استفاده از شیوه های یادگیری زبان ، انگیزه ها ونگرش نسبت به زبان انگلیسی در رابطه با زمینه زبانی زبان آموزان می باشد. هدف بررسی این نکته بود که آیا اختلافی چشمگیر میان زبان آموزان دو زبانه و تک زبانه در میزان استفاده از شیوه های یادگیری زبان ، انگیزه ها نگرش و سطح مهارت زبانی وجود دارد. همچنین سعی شد تا بهترین و موثرترین عوامل پیش بینی کننده ...
15 صفحه اولConauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation
In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a set of generators of the automorphism group of a graph, and test whether two graphs are isomorphic, finding an isomorphism if they are. This algorithm uses the basic individualization/refinement technique, and is an improved version of the algorithm conauto, which has been shown to be very fast for random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2017
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2017.080937